Hiding Backtracking Operations in Software Model Checking from the Environment

نویسندگان

  • Cyrille Artho
  • Yoshinori Tanabe
  • Etsuya Shibayama
  • Watcharin Leungwattanakit
  • Masami Hagiya
چکیده

Most non-trivial applications use some form of input/output (I/O), such as network communication. When model checking such an application, a simple state space exploration scheme is not applicable: Backtracking during the state space search causes states to be revisited, and I/O operations to be repeated. Because I/O operations are visible by the environment, software model checking needs to encapsulate such operations in a caching layer that hides such actions. In order to mediate between the model checker and the environment, the cache layer has to pair request and response messages correctly. It also has to distinguish between complete and partial messages. Finally, operations that open or close communication channels require special treatment as well. —

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cache-based Model Checking of Networked Software

Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such systems. However, a simple state space exploration scheme is not applicable, as backtracking results in repeated communication operations. A cache-based approach solves this problem by hiding redundant communication operations from

متن کامل

Efficient Model Checking of Networked Applications

Most applications today communicate with other processes over a network. Such applications are often multi-threaded. The non-determinism in the thread and communication schedules makes it desirable to model check such applications. When model checking such a networked application, a simple state space exploration scheme is not applicable, as the process being model checked would repeat communic...

متن کامل

Efficient Model Checking of Applications with Input/Output

Most non-trivial applications use some form of input/output (I/O), such as network communication. When model checking such an application, a simple state space exploration scheme is not applicable, as the process being model checked would replay I/O operations when revisiting a given state. Thus software model checking needs to encapsulate such operations in a caching layer that is capable of h...

متن کامل

Efficient Model Checking of Applications with I/O

Most non-trivial applications use input/output (I/O), such as network communication. When model checking such an application, a simple state space exploration scheme is not applicable, as the process being model checked would replay I/O operations when revisiting a given state. Thus a software model checker requires a faithful model, or it has to encapsulate such operations in a cache layer tha...

متن کامل

Conflict-Driven Clause Learning SAT Solvers

One of the main reasons for the widespread use of SAT in many applications is that Conflict-Driven Clause Learning (CDCL) Boolean Satisfiability (SAT) solvers are so effective in practice. Since their inception in the mid-90s, CDCL SAT solvers have been applied, in many cases with remarkable success, to a number of practical applications. Examples of applications include hardware and software m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007